Stochastic Online Shortest Path Routing: The Value of Feedback

The Online Loop-free Stochastic Shortest-Path Problem

We consider a stochastic extension of the loop-free shortest path problem with adversarial rewards. In this episodic Markov decision problem an agent traverses through an acyclic graph with random transitions: at each step of an episode the agent chooses an action, receives some reward, and arrives at a random next state, where the reward and the distribution of the next state depend on the act...

Dynamic shortest path in stochastic dynamic networks: Ship routing problem

In this paper, we apply the stochastic dynamic programming to find the dynamic shortest path from the source node to the sink node in stochastic dynamic networks, in which the arc lengths are independent random variables with exponential distributions. In each node there is an environmental variable, which evolves in accordance with a continuous time Markov process. The parameter of the exponen...

Stochastic Shortest Path Games

We consider dynamic, two-player, zero-sum games where the \minimizing" player seeks to drive an underlying nite-state dynamic system to a special terminal state along a least expected cost path. The \maximizer" seeks to interfere with the minimizer's progress so as to maximize the expected total cost. We consider, for the rst time, undiscounted nite-state problems, with compact action spaces, a...

Multi Constraint Shortest Path Routing

Online Shortest Path using LTI

Finding the shortest path is the one of the tedious problem on the live traffic. There are many existing applications are introduced to overcome this problem but still there is lack of finding the shortest path in live traffic. To overcome this several research has been done on finding shortest traffic especially using wireless sensor networks. The existing method collects the live traffic info...